A LOWER BOUND FOR THE CIRCUMFERENCE OF A GRAPH.LINIAL N.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 15; NO 3; PP. 297-300; BIBL. 3 REF.Article

EXTENDING THE GREENE-KLEITMAN THEOREM TO DIRECTED GRAPHSLINIAL N.1981; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1981; VOL. 30; NO 3; PP. 331-334; BIBL. 7 REF.Article

ON PETERSEN'S GRAPH THEOREMLINIAL N.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 1; PP. 53-56; BIBL. 8 REF.Article

COVERING DIGRAPHS BY PATHSLINIAL N.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 23; NO 3; PP. 257-272; BIBL. 8 REF.Article

Locality in distributed graph algorithmsLINIAL, N.SIAM journal on computing (Print). 1992, Vol 21, Num 1, pp 193-201, issn 0097-5397Article

Hard enumeration problems in geometry and combinatoricsLINIAL, N.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 2, pp 331-335, issn 0196-5212Article

INCIDENCE MATRICES OF SUBSETS - A RANK FORMULALINIAL N; ROTHSCHILD BL.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 3; PP. 333-340; BIBL. 2 REF.Article

Deciding hypergraph 2-colourability by H-resolutionLINIAL, N; TARSI, M.Theoretical computer science. 1985, Vol 38, Num 2-3, pp 343-347, issn 0304-3975Article

Cycles of length 0 modulo k in directed graphsALON, N; LINIAL, N.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 1, pp 114-119, issn 0095-8956Article

Every poset has a central elementLINIAL, N; SAKS, M.Journal of combinatorial theory. Series A. 1985, Vol 40, Num 2, pp 195-210, issn 0097-3165Article

The influence of large coalitionsAJTAI, M; LINIAL, N.Combinatorica (Print). 1993, Vol 13, Num 2, pp 129-145, issn 0209-9683Article

Balancing extensions via Brunn-MinkowskiKAHN, J; LINIAL, N.Combinatorica (Print). 1991, Vol 11, Num 4, pp 363-368, issn 0209-9683Article

Approximate inclusion-exclusionLINIAL, N; NISAN, N.Combinatorica (Print). 1990, Vol 10, Num 4, pp 349-365, issn 0209-9683Article

Group connectivity of graphs. A nonhomogeneous analogue of nowhere-zero flow propertiesJAEGER, F; LINIAL, N; PAYAN, C et al.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 165-182, issn 0095-8956Article

Additive bases of vector spaces over prime fieldsALON, N; LINIAL, N; MESHULAM, R et al.Journal of combinatorial theory. Series A. 1991, Vol 57, Num 2, pp 203-210, issn 0097-3165Article

Optima of dual integer linear programsAHARONI, R; ERDOS, P; LINIAL, N et al.Combinatorica (Print). 1988, Vol 8, Num 1, pp 13-20, issn 0209-9683Article

Fault-tolerant computation in the full information modelGOLDREICH, O; GOLDWASSER, S; LINIAL, N et al.SIAM journal on computing (Print). 1998, Vol 27, Num 2, pp 506-544, issn 0097-5397Article

Some bounds for the Banzhaf index and other semivaluesHOLZMAN, R; LEHRER, E; LINIAL, N et al.Mathematics of operations research. 1988, Vol 13, Num 2, pp 358-363, issn 0364-765XArticle

Constant depth circuits, Fourier transform, and learnabilityLINIAL, N; MANSOUR, Y; NISAN, N et al.Journal of the Association for Computing Machinery. 1993, Vol 40, Num 3, pp 607-620, issn 0004-5411Article

On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannelsBIRK, Y; LINIAL, N; MESHULAM, R et al.IEEE transactions on information theory. 1993, Vol 39, Num 1, pp 186-191, issn 0018-9448Article

Matroidal bijections between graphsLINIAL, N; MESHULAM, R; TARSI, M et al.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 1, pp 31-44, issn 0095-8956Article

Rubber bands, convex embeddings and graph connectivityLINIAL, N; LOVASZ, L; WIGDERSON, A et al.Combinatorica (Print). 1988, Vol 8, Num 1, pp 91-102, issn 0209-9683Article

Some extremal problems arising from discrete control processesLICHTENSTEIN, D; LINIAL, N; SAKS, M et al.Combinatorica (Print). 1989, Vol 9, Num 3, pp 269-287, issn 0209-9683, 19 p.Article

Extremal problems on permutations under cyclic equivalenceERDOS, P; LINIAL, N; MORAN, S et al.Discrete mathematics. 1987, Vol 64, Num 1, pp 1-11, issn 0012-365XArticle

Largest digraphs contained in all n-tournamentsLINIAL, N; SAKS, M; SOS, V. T et al.Combinatorica (Print). 1983, Vol 3, Num 1, pp 101-104, issn 0209-9683Article